Approximate lattice similarity
نویسندگان
چکیده
منابع مشابه
Solving approximate similarity queries
As we know, both nearest neighbor and range searching problems are among the most important and fundamental problems in computational geometry because of its numerous important application areas [1, 2]. Specially, in many modern database applications, high-dimensional searching problems arise when complex objects are represented by vectors of d numeric features. As the dimension d increases hig...
متن کاملSimilarity in Approximate Reasoning
This paper presents an approach to similarity based approximate reasoning that elucidates the connection between similarity and existing approaches to inference in approximate reasoning methodology. A set of axioms is proposed to compute a reasonable measure of similarity between two fuzzy sets. Such a measure of similarity is then used at different stages to derive a conclusion in approximate ...
متن کاملApproximate Searching For Distributional Similarity
Distributional similarity requires large volumes of data to accurately represent infrequent words. However, the nearestneighbour approach to finding synonyms suffers from poor scalability. The Spatial Approximation Sample Hierarchy (SASH), proposed by Houle (2003b), is a data structure for approximate nearestneighbour queries that balances the efficiency/approximation trade-off. We have intergr...
متن کاملApproximate Similarity Queries: A Survey
We review the major paradigms for similarity queries, in particular those that allow approximate results. We propose an original classification schema which easily allows existing approaches to be compared along several independent coordinates, such as quality of results, error metrics, and user interaction.
متن کاملApproximate Reasoning Based on Similarity
The connection between similarity logic and the theory of closure operators is examined. Indeed one proves that the consequence relation defined in [14] can be obtained by composing two closure operators and that the resulting operator is still a closure operator. Also, we extend any similarity into a similarity which is compatible with the logical equivalence, and we prove that this gives the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Crystallographica
سال: 2021
ISSN: ['2053-2733']
DOI: https://doi.org/10.1107/s0108767321098330